Optimal Polygon Decomposition for UAV Survey Coverage Path Planning in Wind
نویسندگان
چکیده
منابع مشابه
Optimal Control for Constrained Coverage Path Planning
The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the ef...
متن کاملCoverage Path Planning: The Boustrophedon Cellular Decomposition
Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, oor scrubbing, and inspection. We developed the boustrophedon cellular decomposition, which is an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon is covered with simple back and forth ...
متن کاملA Decomposition Approach for the Complete Coverage Path Planning Problem
In this paper, a complete coverage path planning problem is discussed, for application in real situations in the areas of agriculture, autonomous robotic house cleaning, and hydrographic survey. Since the approach to this problem is currently being developed, only the work developed so far is presented. In this problem one aims to find the most efficient path or circuit that completely covers a...
متن کاملA survey on coverage path planning for robotics
Coverage Path Planning (CPP) is the task of determining a path that passes over all points of an area or volume of interest while avoiding obstacles. This task is integral to many robotic applications, such as vacuum cleaning robots, painter robots, autonomous underwater vehicles creating image mosaics, demining robots, lawn mowers, automated harvesters, window cleaners and inspection of comple...
متن کاملCoverage Path Planning in Non-Convex Polygon Areas for Orthophotomap Creation Using UAVs
Cílem této práce je implementace algoritmů pro pokrývání nekonvexních oblastí s využitím UAV (Unmanned Aerial Vehicle) a jejich experimentální ověření (jak v simulacích, tak na reálném bezpilotním prostředku). Z existujících algoritmů pro plánování příslušné letové trajektorie byly vybrány tři offline algoritmy využívající exaktní dekompozici oblasti – naivní, Enhanced Exact Cellular Decomposit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2018
ISSN: 1424-8220
DOI: 10.3390/s18072132